Sciweavers

335 search results - page 51 / 67
» How to Use Spanning Trees to Navigate in Graphs
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 5 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
ITNG
2006
IEEE
16 years 1 days ago
Utilizing XML Schema for Describing and Querying Still Image Databases
In this paper, still images are modeled by hierarchical tree structures and object relational graphs. These modeling concepts can be described naturally using XML schema. We intro...
Kazem Taghva, Min Xu, Emma Regentova, Tom Nartker
FLAIRS
2001
15 years 7 months ago
Probabilistic Planning for Behavior-Based Robots
Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensorplanning in the ...
Amin Atrash, Sven Koenig
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 6 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
ADBIS
2005
Springer
163views Database» more  ADBIS 2005»
15 years 11 months ago
XML Databases and Beyond - Plenty of Architectural Challenges Ahead
A key observation is that the invariants in database management determine the mapping steps of the supporting architecture. Referring to the multi-layered architecture of record-or...
Theo Härder