849 search results - page 59 / 170 » The Early Restart Algorithm |
82
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
92
Voted
ICIAP
2007
ACM
15 years 4 months ago
2007
ACM
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...
90
Voted
ACL
2006
15 years 2 months ago
2006
We introduce a new multi-threaded parsing algorithm on unification grammars designed specifically for multimodal interaction and noisy environments. By lifting some traditional co...
102
click to vote
FMSD
2002
15 years 12 days ago
2002
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
96
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Set expansion refers to expanding a partial set of “seed” objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), which e...