Sciweavers

1813 search results - page 184 / 363
» Instance Pruning Techniques
Sort
View
SAT
2010
Springer
174views Hardware» more  SAT 2010»
15 years 4 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
CVPR
2011
IEEE
15 years 4 months ago
Dynamic Batch Mode Active Learning
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
Shayok Chakraborty, Vineeth Balasubramanian, Sethu...
CP
2011
Springer
14 years 6 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
PAM
2012
Springer
14 years 2 months ago
Geolocating IP Addresses in Cellular Data Networks
Smartphones connected to cellular networks are increasingly being used to access Internet-based services. Using data collected from smartphones running a popular location-based app...
Sipat Triukose, Sebastien Ardon, Anirban Mahanti, ...
ICFP
2005
ACM
16 years 6 months ago
Scrap your nameplate: (functional pearl)
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...
James Cheney