Sciweavers

8636 search results - page 195 / 1728
» How Developers Copy
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 6 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
16 years 6 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
MOBIHOC
2006
ACM
16 years 6 months ago
Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
Ben Liang, Min Dong
AOSD
2010
ACM
16 years 1 months ago
Tracking code patterns over multiple software versions with Herodotos
An important element of understanding a software code base is to identify the repetitive patterns of code it contains and how these evolve over time. Some patterns are useful to t...
Nicolas Palix, Julia L. Lawall, Gilles Muller
MICRO
2009
IEEE
144views Hardware» more  MICRO 2009»
16 years 1 months ago
Characterizing flash memory: anomalies, observations, and applications
Despite flash memory’s promise, it suffers from many idiosyncrasies such as limited durability, data integrity problems, and asymmetry in operation granularity. As architects, ...
Laura M. Grupp, Adrian M. Caulfield, Joel Coburn, ...