Sciweavers

17329 search results - page 2876 / 3466
» Improved non-approximability results
Sort
View
223
Voted
NIPS
2008
15 years 8 months ago
Regularized Co-Clustering with Dual Supervision
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
Vikas Sindhwani, Jianying Hu, Aleksandra Mojsilovi...
NIPS
2008
15 years 8 months ago
Human Active Learning
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
Rui M. Castro, Charles Kalish, Robert Nowak, Ruich...
MLMTA
2007
15 years 8 months ago
GenInc: An Incremental Context-Free Grammar Learning Algorithm for Domain-Specific Language Development
- While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to...
Faizan Javed, Marjan Mernik, Barrett R. Bryant, Al...
NETWORKING
2007
15 years 8 months ago
On-Line Predictive Load Shedding for Network Monitoring
Building robust network monitoring applications is hard given the unpredictable nature of network traffic. Complex analysis on streaming network data usually leads to overload situ...
Pere Barlet-Ros, Diego Amores-López, Gianlu...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 8 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
« Prev « First page 2876 / 3466 Last » Next »