194 search results - page 15 / 39 » Some problems, I care most |
109
click to vote
CONSTRAINTS
1998
14 years 9 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
NGC
2002
Springer
14 years 9 months ago
2002
Springer
Abstract Most previous creativity support systems sustain shortterm temporal thinking that is separate from users' daily activities. In this paper, we propose a system to supp...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
BMCBI
2010
14 years 9 months ago
2010
Background: Oligonucleotide arrays have become one of the most widely used high-throughput tools in biology. Due to their sensitivity to experimental conditions, normalization is ...
RIVF
2007
14 years 11 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...