Sciweavers

15 search results - page 3 / 3
» What Should Be Minimized in a Decision Tree
Sort
View
ICALP
2010
Springer
13 years 10 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
LCTRTS
2005
Springer
13 years 10 months ago
Efficient application migration under compiler guidance
Mobile computing based upon wireless technology as the interconnect and PDAs, Web-enabled cell phones etc. as the end devices provide a rich infrastructure for anywhere, anytime i...
Kun Zhang, Santosh Pande
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
13 years 10 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
TLCA
2005
Springer
13 years 10 months ago
Privacy in Data Mining Using Formal Methods
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
Stan Matwin, Amy P. Felty, István T. Hern&a...
PPOPP
1997
ACM
13 years 9 months ago
The Interaction of Parallel Programming Constructs and Coherence Protocols
Some of the most common parallel programming idioms include locks, barriers, and reduction operations. The interaction of these programming idioms with the multiprocessor's c...
Ricardo Bianchini, Enrique V. Carrera, Leonidas I....