Sciweavers

207 search results - page 38 / 42
» Data Structures for Storing Small Sets in the Bitprobe Model
Sort
View
NSF
2001
Springer
197views Computer Vision» more  NSF 2001»
13 years 12 months ago
A Collaborative Infrastructure for Mobile and Wireless Systems
Today‘s use of mobile phones is mostly for coordination purposes. It seems reasonable to assume that 3G and 4G high bandwidth systems will be used in a similar way. This paper th...
Lutz Michael Wegner, Morad Ahmad, Stefan Fröh...
NIPS
2004
13 years 8 months ago
Identifying Protein-Protein Interaction Sites on a Genome-Wide Scale
Protein interactions typically arise from a physical interaction of one or more small sites on the surface of the two proteins. Identifying these sites is very important for drug ...
Haidong Wang, Eran Segal, Asa Ben-Hur, Daphne Koll...
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
EOR
2007
165views more  EOR 2007»
13 years 7 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang
ICS
2001
Tsinghua U.
13 years 12 months ago
Cache performance for multimedia applications
The caching behavior of multimedia applications has been described as having high instruction reference locality within small loops, very large working sets, and poor data cache p...
Nathan T. Slingerland, Alan Jay Smith