Sciweavers

13603 search results - page 292 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
COMGEO
2006
ACM
15 years 6 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
FGCS
2007
160views more  FGCS 2007»
15 years 6 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
PAMI
2006
229views more  PAMI 2006»
15 years 6 months ago
A Coherent Computational Approach to Model Bottom-Up Visual Attention
Visual attention is a mechanism which filters out redundant visual information and detects the most relevant parts of our visual field. Automatic determination of the most visually...
Olivier Le Meur, Patrick Le Callet, Dominique Barb...
BMCBI
2005
122views more  BMCBI 2005»
15 years 6 months ago
Computational verification of protein-protein interactions by orthologous co-expression
Background: High-throughput methods identify an overwhelming number of protein-protein interactions. However, the limited accuracy of these methods results in the false identifica...
Itay Tirosh, Naama Barkai
FEDCSIS
2011
90views more  FEDCSIS 2011»
14 years 6 months ago
Services Composition Model for Home-Automation peer-to-peer Pervasive Computing
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...
Juan A. Holgado-Terriza, Sandra Rodríguez-V...