Sciweavers

2479 search results - page 232 / 496
» Quantum complexity theory
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...
162
Voted
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
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 7 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
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...