Sciweavers

10493 search results - page 1339 / 2099
» Dynamic Word Problems
Sort
View
RECOMB
2001
Springer
16 years 7 months ago
Analysis techniques for microarray time-series data
We address possible limitations of publicly available data sets of yeast gene expression. We study the predictability of known regulators via time-series analysis, and show that l...
Vladimir Filkov, Steven Skiena, Jizu Zhi
206
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 7 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
211
Voted
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 7 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
217
Voted
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
16 years 7 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
SIGMOD
2001
ACM
145views Database» more  SIGMOD 2001»
16 years 7 months ago
Automatic Segmentation of Text into Structured Records
In this paper we present a method for automatically segmenting unformatted text records into structured elements. Several useful data sources today are human-generated as continuo...
Vinayak R. Borkar, Kaustubh Deshmukh, Sunita Saraw...
« Prev « First page 1339 / 2099 Last » Next »