Sciweavers

1431 search results - page 97 / 287
» The complexity of random ordered structures
Sort
View
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
15 years 2 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
RECOMB
2002
Springer
16 years 3 months ago
Tests for gene clustering
Comparing chromosomal gene order in two or more related species is an important approach to studying the forces that guide genome organization and evolution. Linked clusters of si...
Dannie Durand, David Sankoff
UAI
2008
15 years 4 months ago
Feature Selection via Block-Regularized Regression
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...
Seyoung Kim, Eric P. Xing
ESA
2007
Springer
121views Algorithms» more  ESA 2007»
15 years 9 months ago
Finding Frequent Elements in Non-bursty Streams
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
Rina Panigrahy, Dilys Thomas
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
15 years 8 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly