Sciweavers

1734 search results - page 36 / 347
» its 2000
Sort
View
ACL
2000
15 years 6 months ago
A Polynomial-Time Fragment of Dominance Constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
Alexander Koller, Kurt Mehlhorn, Joachim Niehren
COMBINATORICS
2000
73views more  COMBINATORICS 2000»
15 years 5 months ago
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
Vera Rosta
FQAS
2000
Springer
107views Database» more  FQAS 2000»
15 years 9 months ago
Measuring Effectiveness in Fuzzy Information Retrieval
- We investigate extensions of the classical measurement of effectiveness in information retrieval systems, precision and recall, to situations where the answer is modeled by a fuz...
Maria J. Martín-Bautista, Daniel Sán...
ICDE
2000
IEEE
156views Database» more  ICDE 2000»
16 years 6 months ago
Oracle8i - The XML Enabled Data Management System
XML is here as the internet standard for information exchange among e-businesses and applications. With its dramatic adoption and its ability to model structured, unstructured and...
Sandeepan Banerjee, Vishu Krishnamurthy, Muralidha...
WDAS
2000
15 years 6 months ago
Scalable Distributed Data Structures for High-Performance Databases
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...
Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...