Sciweavers

180 search results - page 19 / 36
» heuristics 2011
Sort
View
70
Voted
3DUI
2011
75views more  3DUI 2011»
13 years 9 months ago
Dropping the ball: Releasing a virtual grasp
We present a method for improved release of whole-hand virtual grasps. It addresses the problem of objects “sticking” during release after the user’s (real) fingers interpen...
Mores Prachyabrued, Christoph W. Borst
IACR
2011
141views more  IACR 2011»
13 years 9 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
94
Voted
ACL
2012
12 years 12 months ago
SITS: A Hierarchical Nonparametric Model using Speaker Identity for Topic Segmentation in Multiparty Conversations
One of the key tasks for analyzing conversational data is segmenting it into coherent topic segments. However, most models of topic segmentation ignore the social aspect of conver...
Viet-An Nguyen, Jordan L. Boyd-Graber, Philip Resn...
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
14 years 8 days ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
103
Voted
AI
2011
Springer
14 years 4 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...