Sciweavers

1952 search results - page 15 / 391
» Complete partitions of graphs
Sort
View
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
15 years 10 months ago
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
Javier Esparza, Petr Jancar, Alexander Miller
106
Voted
ICML
2000
IEEE
16 years 5 months ago
Complete Cross-Validation for Nearest Neighbor Classifiers
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
Matthew D. Mullin, Rahul Sukthankar
148
Voted
SSD
2007
Springer
107views Database» more  SSD 2007»
15 years 10 months ago
Spatial Partition Graphs: A Graph Theoretic Model of Maps
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
Mark McKenney, Markus Schneider
126
Voted
SIAMDM
2010
133views more  SIAMDM 2010»
15 years 2 months ago
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 4 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu