2376 search results - page 293 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
ML
2008
ACM
14 years 10 months ago
2008
ACM
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...
105
click to vote
ADT
2005
14 years 10 months ago
2005
In this paper we present a new framework, based on subdivision surface approximation, for efficient compression and coding of 3D models represented by polygonal meshes. Our algorit...
88
Voted
ESA
2008
Springer
15 years 4 days ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
JCST
2007
14 years 10 months ago
2007
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
98
Voted
SPIESR
2003
14 years 11 months ago
2003
Abstract—We propose a fully automatic and computationally efficient framework for analysis and summarization of soccer videos using cinematic and object-based features. The propo...