ผลต่างระหว่างรุ่นของ "ผลงานวิจัย"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) |
|||
| แถว 1: | แถว 1: | ||
| − | + | ricdom | |
| + | à¸à¸¥à¸à¸²à¸à¸§à¸´à¸à¸±à¸¢à¹à¸à¹à¸à¸à¸²à¸¡à¸ªà¸²à¸à¸²à¸à¸±à¸à¸à¸µà¹ | ||
| − | == | + | == à¸à¸±à¸¥à¸à¸à¸£à¸´à¸à¸¶à¸¡à¸à¸à¸à¸£à¸²à¸à¹à¸¥à¸°à¹à¸à¸£à¸·à¸à¸à¹à¸²à¸¢ == |
# [http://www.cpe.ku.ac.th/~jtf/papers/semi.ps '''A faster algorithm for finding optimal semi-matching'''] (Unpublished manuscript) | # [http://www.cpe.ku.ac.th/~jtf/papers/semi.ps '''A faster algorithm for finding optimal semi-matching'''] (Unpublished manuscript) | ||
| แถว 7: | แถว 8: | ||
# [http://www.cpe.ku.ac.th/~jtf/papers/smallsplit.ps '''Detecting and cleaning intruders in sensor networks'''] (NCSEC'04) | # [http://www.cpe.ku.ac.th/~jtf/papers/smallsplit.ps '''Detecting and cleaning intruders in sensor networks'''] (NCSEC'04) | ||
| − | == | + | == à¸à¸±à¸¥à¸à¸à¸£à¸´à¸à¸¶à¸¡à¸à¸²à¸£à¸à¸£à¸°à¸¡à¸²à¸ == |
# [http://www.cpe.ku.ac.th/~jtf/papers/dist-steiner.pdf '''Simple distributed algorithms for approximating Steiner trees'''] (COCOON'05) | # [http://www.cpe.ku.ac.th/~jtf/papers/dist-steiner.pdf '''Simple distributed algorithms for approximating Steiner trees'''] (COCOON'05) | ||
| − | == | + | == à¸à¸¤à¸©à¸à¸µà¸à¸²à¸£à¹à¸£à¸µà¸¢à¸à¸£à¸¹à¹à¹à¸à¸´à¸à¸à¸³à¸à¸§à¸ == |
# [http://www.cpe.ku.ac.th/~jtf/papers/blackbox.ps '''Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors'''] (ALT'05) | # [http://www.cpe.ku.ac.th/~jtf/papers/blackbox.ps '''Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors'''] (ALT'05) | ||
# [http://www.cpe.ku.ac.th/~jtf/papers/multiclass.ps '''POLL: multiclass classification from binary classifiers through random sampling'''](InTech'03) | # [http://www.cpe.ku.ac.th/~jtf/papers/multiclass.ps '''POLL: multiclass classification from binary classifiers through random sampling'''](InTech'03) | ||
| แถว 17: | แถว 18: | ||
| − | == | + | == à¸à¸·à¹à¸à¹ == |
รุ่นแก้ไขเมื่อ 18:20, 11 ตุลาคม 2550
ricdom à¸à¸¥à¸à¸²à¸à¸§à¸´à¸à¸±à¸¢à¹à¸à¹à¸à¸à¸²à¸¡à¸ªà¸²à¸à¸²à¸à¸±à¸à¸à¸µà¹
เนื้อหา
à¸à¸±à¸¥à¸à¸à¸£à¸´à¸à¸¶à¸¡à¸à¸à¸à¸£à¸²à¸à¹à¸¥à¸°à¹à¸à¸£à¸·à¸à¸à¹à¸²à¸¢
- A faster algorithm for finding optimal semi-matching (Unpublished manuscript)
- A deterministic nearly linear-time algorithm for finding minimum cuts in planar graphs (SODA'04)
- Detecting and cleaning intruders in sensor networks (NCSEC'04)
à¸à¸±à¸¥à¸à¸à¸£à¸´à¸à¸¶à¸¡à¸à¸²à¸£à¸à¸£à¸°à¸¡à¸²à¸
à¸à¸¤à¸©à¸à¸µà¸à¸²à¸£à¹à¸£à¸µà¸¢à¸à¸£à¸¹à¹à¹à¸à¸´à¸à¸à¸³à¸à¸§à¸
- Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors (ALT'05)
- POLL: multiclass classification from binary classifiers through random sampling(InTech'03)
- A note on randomized DDAG (Unpublished)
