Sciweavers

8949 search results - page 1600 / 1790
» is 1998
Sort
View
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 6 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
SIAMDM
1998
95views more  SIAMDM 1998»
15 years 6 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
SIAMDM
1998
86views more  SIAMDM 1998»
15 years 6 months ago
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
Douglas R. Stinson, Ruizhong Wei
PUC
2002
82views more  PUC 2002»
15 years 6 months ago
A Location Model for Communicating and Processing of Context
Location is one of the most important elements of context in ubiquitous computing. In this paper we describe a location model, a spatial-aware communication model and an implement...
Michael Beigl, Tobias Zimmer, Christian Decker
SIGIR
1998
ACM
15 years 6 months ago
Exploring the Similarity Space
Ranked queries are used to locate relevant documents in text databases. In a ranked query a list of terms is specified, then the documents that most closely match the query are re...
Justin Zobel, Alistair Moffat
« Prev « First page 1600 / 1790 Last » Next »