Sciweavers

7 search results - page 1 / 2
» Generating All Vertices of a Polyhedron Is Hard
Sort
View
DCG
2008
71views more  DCG 2008»
13 years 5 months ago
Generating All Vertices of a Polyhedron Is Hard
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
KDD
2007
ACM
193views Data Mining» more  KDD 2007»
14 years 5 months ago
Joint optimization of wrapper generation and template detection
Many websites have large collections of pages generated dynamically from an underlying structured source like a database. The data of a category are typically encoded into similar...
Shuyi Zheng, Ruihua Song, Ji-Rong Wen, Di Wu
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 7 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
ISSTA
2004
ACM
13 years 10 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
IH
1999
Springer
13 years 9 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak