297 search results - page 26 / 60 » Every Sequence Is Decompressible from a Random One |
102
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
115
Voted
ICIP
2008
IEEE
16 years 23 days ago
2008
IEEE
In this paper, a motion-based approach for detecting high-level semantic events in video sequences is presented. Its main characteristic is its generic nature, i.e. it can be dire...
BMCBI
2005
14 years 11 months ago
2005
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
136
Voted
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
AAAI
2004
15 years 13 days ago
2004
CAT's knowledge base contains abstract task or example "abstract flight reservation task," which can be included in a workflow as placeholders. CAT will gest that us...