Sciweavers

26354 search results - page 202 / 5271
» How we refactor, and how we know it
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Compressed sensing with sequential observations
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of measurements. The results in the literature have focuse...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
AIIA
2007
Springer
16 years 23 days ago
English Querying over Ontologies: E-QuOnto
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
Raffaella Bernardi, Francesca Bonin, Diego Calvane...
ISSTA
2004
ACM
16 years 14 hour ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
ICSE
2010
IEEE-ACM
15 years 11 months ago
LSdiff: a program differencing tool to identify systematic structural differences
Program differencing tools such as GNU diff identify individual differences but do not determine how those differences are related to each other. For example, an extract super...
Alex Loh, Miryung Kim
CIDR
2009
167views Algorithms» more  CIDR 2009»
15 years 7 months ago
Unbundling Transaction Services in the Cloud
The traditional architecture for a DBMS engine has the recovery, concurrency control and access method code tightly bound together in a storage engine for records. We propose a di...
David B. Lomet, Alan Fekete, Gerhard Weikum, Micha...