Sciweavers

1968 search results - page 362 / 394
» The Complexity of Valued Constraint Models
Sort
View
ICML
2004
IEEE
14 years 9 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
ISBI
2008
IEEE
14 years 2 months ago
Automated gland and nuclei segmentation for grading of prostate and breast cancer histopathology
Automated detection and segmentation of nuclear and glandular structures is critical for classification and grading of prostate and breast cancer histopathology. In this paper, w...
Shivang Naik, Scott Doyle, Shannon Agner, Anant Ma...
SECON
2007
IEEE
14 years 2 months ago
Coverage Problem for Sensors Embedded in Temperature Sensitive Environments
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
Arunabha Sen, Nibedita Das, Ling Zhou, Bao Hong Sh...
ATAL
2007
Springer
14 years 13 days ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
POPL
2010
ACM
13 years 11 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...