Sciweavers

11394 search results - page 198 / 2279
» Error-Correcting Data Structures
Sort
View
89
Voted
ROBOCUP
2005
Springer
102views Robotics» more  ROBOCUP 2005»
15 years 9 months ago
Discovering Relevant Sensor Data by Q-Analysis
Abstract. This paper proposes a novel method for supervised classification based on the methodology of Q-analysis. The classification is based on finding ‘relevant’ structur...
Pejman Iravani
141
Voted
MVA
2010
130views Computer Vision» more  MVA 2010»
15 years 1 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh
DAGSTUHL
1998
15 years 4 months ago
Segmented Iterators and Hierarchical Algorithms
Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unneces...
Matthew H. Austern
190
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
188
Voted
SIGMOD
2008
ACM
118views Database» more  SIGMOD 2008»
16 years 3 months ago
Freebase: a collaboratively created graph database for structuring human knowledge
Freebase is a practical, scalable tuple database used to structure general human knowledge. The data in Freebase is collaboratively created, structured, and maintained. Freebase c...
Kurt D. Bollacker, Colin Evans, Praveen Paritosh, ...