994 search results - page 78 / 199 » Custom Computing Machines for the Set Covering Problem |
133
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
209
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 5 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
119
Voted
ML
2010
ACM
14 years 7 months ago
2010
ACM
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
123
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...
119
click to vote
KIVS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and servi...