Sciweavers

20197 search results - page 3973 / 4040
» Comparing Computational Power
Sort
View
SIGIR
2010
ACM
13 years 8 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 8 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
ICASSP
2010
IEEE
13 years 8 months ago
Reconstruction of sparse signals from distorted randomized measurements
In this paper we show that, surprisingly, it is possible to recover sparse signals from nonlinearly distorted measurements, even if the nonlinearity is unknown. Assuming just that...
Petros Boufounos
AI
2010
Springer
13 years 7 months ago
Automatically generating personalized user interfaces with Supple
Today's computer-human interfaces are typically designed with the assumption that they are going to be used by an able-bodied person, who is using a typical set of input and ...
Krzysztof Z. Gajos, Daniel S. Weld, Jacob O. Wobbr...
AI
2008
Springer
13 years 7 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
« Prev « First page 3973 / 4040 Last » Next »