Sciweavers

9842 search results - page 1766 / 1969
» Problem complexity
Sort
View
IJCAI
1997
15 years 7 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
PVLDB
2008
167views more  PVLDB 2008»
15 years 6 months ago
Managing and querying transaction-time databases under schema evolution
The old problem of managing the history of database information is now made more urgent and complex by fast spreading web information systems, such as Wikipedia. Our PRIMA system ...
Hyun Jin Moon, Carlo Curino, Alin Deutsch, Chien-Y...
PR
2007
149views more  PR 2007»
15 years 6 months ago
Real-time detection of steam in video images
In this paper, we present a real-time image processing technique for the detection of steam in video images. The assumption made is that the presence of steam acts as a blurring p...
Ricardo J. Ferrari, H. Zhang, C. R. Kube
CGO
2011
IEEE
14 years 10 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
CONCUR
2009
Springer
16 years 1 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
« Prev « First page 1766 / 1969 Last » Next »