Sciweavers

575 search results - page 74 / 115
» Wichita State University
Sort
View
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
SAS
2009
Springer
214views Formal Methods» more  SAS 2009»
14 years 8 months ago
Abstract Interpretation of FIFO Replacement
Interpretation of FIFO Replacement Daniel Grund and Jan Reineke Saarland University, Saarbr?ucken, Germany In hard real-time systems, the execution time of programs must be bounded...
Daniel Grund, Jan Reineke
KDD
2004
ACM
112views Data Mining» more  KDD 2004»
14 years 8 months ago
A rank sum test method for informative gene discovery
Finding informative genes from microarray data is an important research problem in bioinformatics research and applications. Most of the existing methods rank features according t...
Lin Deng, Jian Pei, Jinwen Ma, Dik Lun Lee
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 8 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
PODS
2002
ACM
98views Database» more  PODS 2002»
14 years 8 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan