Sciweavers

2200 search results - page 164 / 440
» Bloch's Constant is Computable
Sort
View
IWPEC
2009
Springer
16 years 1 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
ICPR
2008
IEEE
16 years 29 days ago
Graph cut based deformable model with statistical shape priors
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
Noha Youssry El-Zehiry, Adel Elmaghraby
IPPS
2008
IEEE
16 years 28 days ago
Supporting high performance bioinformatics flat-file data processing using indices
As an essential part of in vitro analysis, biological database query has become more and more important in the research process. A few challenges that are specific to bioinformat...
Xuan Zhang, Gagan Agrawal
PDP
2008
IEEE
16 years 27 days ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
PDP
2008
IEEE
16 years 27 days ago
Distributed Sparse Spatial Selection Indexes
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
Veronica Gil Costa, Mauricio Marín