Sciweavers

5448 search results - page 1060 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
MOBISYS
2009
ACM
16 years 29 days ago
A framework of energy efficient mobile sensing for automatic user state recognition
Urban sensing, participatory sensing, and user activity recognition can provide rich contextual information for mobile applications such as social networking and location-based se...
Yi Wang, Jialiu Lin, Murali Annavaram, Quinn Jacob...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 25 days ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
16 years 25 days ago
Exploiting response models: optimizing cross-sell and up-sell opportunities in banking
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant mome...
Andrew Storey, Marc-David Cohen
POPL
2003
ACM
16 years 22 days ago
Interprocedural compatibility analysis for static object preallocation
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. ...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 22 days ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
« Prev « First page 1060 / 1090 Last » Next »