Sciweavers

9626 search results - page 1729 / 1926
» Invariant Based Programming
Sort
View
112
Voted
MP
2006
88views more  MP 2006»
15 years 2 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
152
Voted
PERVASIVE
2006
Springer
15 years 2 months ago
iCAP: Interactive Prototyping of Context-Aware Applications
Although numerous context-aware applications have been developed and there have been technological advances for acquiring contextual information, it is still difficult to develop a...
Anind K. Dey, Timothy Sohn, Sara Streng, Justin Ko...
109
Voted
PR
2006
102views more  PR 2006»
15 years 2 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
130
Voted
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 2 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
117
Voted
SIGIR
2008
ACM
15 years 2 months ago
Optical character recognition errors and their effects on natural language processing
Errors are unavoidable in advanced computer vision applications such as optical character recognition, and the noise induced by these errors presents a serious challenge to downstr...
Daniel P. Lopresti
« Prev « First page 1729 / 1926 Last » Next »