Sciweavers

4934 search results - page 946 / 987
» complexity 2008
Sort
View
EIT
2008
IEEE
15 years 10 months ago
Taming XML: Objects first, then markup
Abstract—Processing markup in object-oriented languages often requires the programmer to focus on the objects generating the markup rather than the more pertinent domain objects....
Matt Bone, Peter F. Nabicht, Konstantin Läufe...
FCCM
2008
IEEE
160views VLSI» more  FCCM 2008»
15 years 10 months ago
Facilitating Processor-Based DPR Systems for non-DPR Experts
Currently, only Xilinx Field Programmable Gate Arrays (FPGAs) support Dynamic Partial Reconfiguration (DPR). While there is currently some Computer Aided Design (CAD) tool support...
Edward Chen, William A. Gruver, Dorian Sabaz, Lesl...
FCCM
2008
IEEE
212views VLSI» more  FCCM 2008»
15 years 10 months ago
Map-reduce as a Programming Model for Custom Computing Machines
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
Jackson H. C. Yeung, C. C. Tsang, Kuen Hung Tsoi, ...
FDL
2008
IEEE
15 years 10 months ago
Contradiction Analysis for Constraint-based Random Simulation
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
Daniel Große, Robert Wille, Robert Siegmund,...
155
Voted
FOCS
2008
IEEE
15 years 10 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...