Sciweavers

2233 search results - page 192 / 447
» On the Complexity of Theory Curbing
Sort
View
CVPR
2006
IEEE
16 years 8 months ago
Dynamics Based Robust Motion Segmentation
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
Roberto Lublinerman, Mario Sznaier, Octavia I. Cam...
ICIP
2001
IEEE
16 years 8 months ago
B-spline active contours for fast video segmentation
Video segmentation is among the most important challenges of video processing and compression (MPEG-4 and MPEG-7). A drawback of classical methods is the computational cost due to...
Frédéric Precioso, Michel Barlaud
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 6 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
COMPLEX
2009
Springer
16 years 1 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang