14699 search results - page 391 / 2940 » Complexity and Cognitive Computing |
145
click to vote
SAS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
228
click to vote
IWPEC
2010
Springer
15 years 2 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
159
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Many recognition algorithms depend on careful positioning of an object into a canonical pose, so the position of features relative to a fixed coordinate system can be examined. Cu...
136
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Learning dominant motion patterns or activities from a video is an important surveillance problem, especially in crowded environments like markets, subways etc., where tracking of...
112
click to vote
CHI
2005
ACM
16 years 5 months ago
2005
ACM
Designers of information visualization systems have the choice to present information in a single integrated view or in multiple views. In practice, there is a continuum between t...