Sciweavers

1388 search results - page 271 / 278
» Querying Linguistic Trees
Sort
View
98
Voted
ICS
2010
Tsinghua U.
15 years 9 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 7 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
15 years 7 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
112
Voted
P2P
2009
IEEE
122views Communications» more  P2P 2009»
15 years 7 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
96
Voted
RECSYS
2009
ACM
15 years 6 months ago
Conceptual recommender system for CiteSeerX
Short search engine queries do not provide contextual information, making it difficult for traditional search engines to understand what users are really requesting. One approach ...
Ajith Kodakateri Pudhiyaveetil, Susan Gauch, Hiep ...