Sciweavers

884 search results - page 136 / 177
» Algorithms for Implicit Deformable Models
Sort
View
IJCV
2006
115views more  IJCV 2006»
15 years 2 months ago
Object Recognition as Many-to-Many Feature Matching
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman...
127
Voted
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 6 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
VLDB
1994
ACM
119views Database» more  VLDB 1994»
15 years 6 months ago
Bulk Loading into an OODB: A Performance Study
Object-oriented database OODB users bring with them large quantities of legacy data megabytes and even gigabytes. In addition, scienti c OODB users continually generate new data. ...
Janet L. Wiener, Jeffrey F. Naughton
DNA
2009
Springer
145views Bioinformatics» more  DNA 2009»
15 years 9 months ago
Distributed Agreement in Tile Self-assembly
Abstract. Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several rese...
Aaron Sterling
GLOBECOM
2008
IEEE
15 years 9 months ago
Performance Metric Sensitivity Computation for Optimization and Trade-Off Analysis in Wireless Networks
Abstract—We develop and evaluate a new method for estimating and optimizing various performance metrics for multihop wireless networks, including MANETs. We introduce an approxim...
John S. Baras, Vahid Tabatabaee, George Papageorgi...