Sciweavers

3991 search results - page 83 / 799
» Bounding homogeneous models
Sort
View
ICIP
2006
IEEE
14 years 9 months ago
Region Based Segmentation Using the Tree of Shapes
The tree of shapes is a powerful tool for image representation which holds many interesting properties. There are many works in the literature that use it for image segmentation, ...
Gregory Randall, Juan Cardelino, Marcelo Bertalm&i...
JDWM
2007
112views more  JDWM 2007»
13 years 7 months ago
Empowering the OLAP Technology to Support Complex Dimension Hierarchies
Comprehensive data analysis has become indispensable in a variety of domains. OLAP (On-Line Analytical Processing) systems tend to perform poorly or even fail when applied to comp...
Svetlana Mansmann, Marc H. Scholl
TSE
2002
96views more  TSE 2002»
13 years 7 months ago
Better Reliability Assessment and Prediction through Data Clustering
This paper presents a new approach to software reliability modeling by grouping data into clusters of homogeneous failure intensities. This series of data clusters associated with...
Jeff Tian
TCC
2005
Springer
94views Cryptology» more  TCC 2005»
14 years 1 months ago
Optimal Error Correction Against Computationally Bounded Noise
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capab...
Silvio Micali, Chris Peikert, Madhu Sudan, David A...
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
14 years 1 months ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan