Sciweavers

2435 search results - page 297 / 487
» Question Answering in Webclopedia
Sort
View
ENTCS
2002
61views more  ENTCS 2002»
15 years 6 months ago
Effectively Absolute Continuity and Effective Jordan Decomposability
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
Xizhong Zheng, Robert Rettinger, Burchard von Brau...
JILP
2000
103views more  JILP 2000»
15 years 6 months ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
15 years 6 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
INTR
2007
90views more  INTR 2007»
15 years 6 months ago
Classification and synthesis of quality approaches in e-government services
ed abstract Purpose: The purpose of this paper is to present a multi-faceted summary and classification of the existing literature in the field of quality of service for egovernmen...
Christos Halaris, Babis Magoutas, Xenia Papadomich...
INTEGRATION
2002
57views more  INTEGRATION 2002»
15 years 6 months ago
To Booth or not to Booth
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...
Wolfgang J. Paul, Peter-Michael Seidel