Sciweavers

10493 search results - page 1931 / 2099
» Dynamic Word Problems
Sort
View
247
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
16 years 10 days ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
ICCS
2004
Springer
16 years 10 days ago
Petri Nets as Executable Specifications of High-Level Timed Parallel Systems
We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show t...
Franck Pommereau
TAL
2004
Springer
16 years 9 days ago
One Size Fits All? A Simple Technique to Perform Several NLP Tasks
Word fragments or n-grams have been widely used to perform different Natural Language Processing tasks such as information retrieval [1] [2], document categorization [3], automatic...
Daniel Gayo-Avello, Darío Álvarez Gu...
203
Voted
VLDB
2004
ACM
118views Database» more  VLDB 2004»
16 years 8 days ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
213
Voted
COMPGEOM
2003
ACM
16 years 6 days ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
« Prev « First page 1931 / 2099 Last » Next »