Sciweavers

107 search results - page 18 / 22
» On the structure of graphs in the Caucal hierarchy
Sort
View
SENSYS
2005
ACM
14 years 29 days ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...
MICCAI
2007
Springer
14 years 8 months ago
Prior Knowledge Driven Multiscale Segmentation of Brain MRI
We present a novel automatic multiscale algorithm applied to segmentation of anatomical structures in brain MRI. The algorithm which is derived from algebraic multigrid, uses a gra...
Ayelet Akselrod-Ballin, Meirav Galun, Moshe John G...
ECCC
2006
145views more  ECCC 2006»
13 years 7 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 1 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
INFOCOM
2006
IEEE
14 years 1 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas