Sciweavers

151 search results - page 13 / 31
» Hyperbolic Graphs of Small Complexity
Sort
View
SAMT
2007
Springer
138views Multimedia» more  SAMT 2007»
14 years 4 months ago
A Constraint-Based Graph Visualisation Architecture for Mobile Semantic Web Interfaces
Abstract. Multimodal and dialogue-based mobile interfaces to the Semantic Web offer access to complex knowledge and information structures. We explore more fine-grained co-ordina...
Daniel Sonntag, Philipp Heim
COCOON
2007
Springer
14 years 4 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
ICML
2004
IEEE
14 years 3 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
IJCAI
2001
13 years 11 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
ECCC
2000
113views more  ECCC 2000»
13 years 9 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich