Sciweavers

2850 search results - page 359 / 570
» On Timed Models and Full Abstraction
Sort
View
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
15 years 12 months ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas
ICDT
2003
ACM
202views Database» more  ICDT 2003»
15 years 12 months ago
Condensed Representation of Database Repairs for Consistent Query Answering
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
Jef Wijsen
PODS
2010
ACM
150views Database» more  PODS 2010»
15 years 11 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
BICOB
2010
Springer
15 years 11 months ago
A Grid-Enabled Problem Solving Environment for QTL Analysis in R
We present a grid-enabled problem solving environment (PSE), for multidimensional QTL analysis. The concept of a computational grid has not been fully realized within this and oth...
Mahen Jayawardena, Carl Nettelblad, Salman Zubair ...
OOPSLA
1995
Springer
15 years 10 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....