Sciweavers

4854 search results - page 868 / 971
» It's the Programming, Stupid
Sort
View
DAM
2007
107views more  DAM 2007»
14 years 10 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
TCAD
2008
101views more  TCAD 2008»
14 years 10 months ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
BMCBI
2005
108views more  BMCBI 2005»
14 years 10 months ago
Storing, linking, and mining microarray databases using SRS
Background: SRS (Sequence Retrieval System) has proven to be a valuable platform for storing, linking, and querying biological databases. Due to the availability of a broad range ...
Antoine Veldhoven, Don de Lange, Marcel Smid, Vict...
WS
2008
ACM
14 years 10 months ago
ActiveRDF: Embedding Semantic Web data into object-oriented languages
Semantic Web applications share a large portion of development effort with database-driven Web applications. Existing approaches for development of these database-driven applicati...
Eyal Oren, Benjamin Heitmann, Stefan Decker
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 10 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard