53327 search results - page 10664 / 10666 » or 2007 |
AAAI
2007
13 years 9 months ago
2007
A traditional goal of Artificial Intelligence research has been a system that can read unrestricted natural language texts on a given topic, build a model of that topic and reason...
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
BMCBI
2008
13 years 7 months ago
2008
Background: Network Component Analysis (NCA) has shown its effectiveness in discovering regulators and inferring transcription factor activities (TFAs) when both microarray data a...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
EXPERT
2007
13 years 7 months ago
2007
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...