Sciweavers

69 search results - page 13 / 14
» Maximal Intersection Queries in Randomized Input Models
Sort
View
COLT
2007
Springer
13 years 12 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
ECCV
2002
Springer
14 years 7 months ago
Parsing Images into Region and Curve Processes
Abstract. Natural scenes consist of a wide variety of stochastic patterns. While many patterns are represented well by statistical models in two dimensional regions as most image s...
Zhuowen Tu, Song Chun Zhu
FOCS
2008
IEEE
14 years 7 days ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
KES
2011
Springer
13 years 22 days ago
Recommendation for English multiple-choice cloze questions based on expected test scores
When students study for multiple-choice cloze tests as the Test of English for International Communication (TOEIC), they tend to repeatedly tackle questions of the same type. In su...
Tomoharu Iwata, Tomoko Kojiri, Takeshi Yamada, Toy...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 11 days ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...