Sciweavers

777 search results - page 116 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 9 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
ICDM
2006
IEEE
95views Data Mining» more  ICDM 2006»
14 years 2 months ago
TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
Hui Xiong, Mark Brodie, Sheng Ma
AUTOMATICA
2010
127views more  AUTOMATICA 2010»
13 years 7 months ago
Partitioning datasets based on equalities among parameters
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
Riccardo Porreca, Giancarlo Ferrari-Trecate
FCT
2009
Springer
14 years 16 days ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
SPAA
2004
ACM
14 years 2 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén