Sciweavers

16844 search results - page 3076 / 3369
» How to Design Programs
Sort
View
CHI
2011
ACM
14 years 10 months ago
No clicks, no problem: using cursor movements to understand and improve search
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
Jeff Huang, Ryen W. White, Susan T. Dumais
CVIU
2011
14 years 10 months ago
Markerless reconstruction and synthesis of dynamic facial expressions
In this paper we combine methods from the field of computer vision with surface editing techniques to generate animated faces, which are all in full correspondence to each other....
Dominik Sibbing, Martin Habbecke, Leif Kobbelt
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
14 years 9 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
AEOG
2011
143views more  AEOG 2011»
14 years 6 months ago
Analyzing the effects of scale and land use pattern metrics on land use database generalization indices
The generalization index system is one of the critical issues for computer-aided land use database generalization. This paper studies the scale and land use pattern effects on lan...
Yaolin Liu, Limin Jiao, Yanfang Liu
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
14 years 6 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
« Prev « First page 3076 / 3369 Last » Next »