Sciweavers

25 search results - page 4 / 5
» Exploiting Partial Information in Taxonomy Construction
Sort
View
CORR
2007
Springer
129views Education» more  CORR 2007»
13 years 7 months ago
A Rank-Metric Approach to Error Control in Random Network Coding
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
Danilo Silva, Frank R. Kschischang, Ralf Koetter
TSMC
2008
109views more  TSMC 2008»
13 years 7 months ago
Providing Justifications in Recommender Systems
Abstract--Recommender systems are gaining widespread acceptance in e-commerce applications to confront the "information overload" problem. Providing justification to a re...
Panagiotis Symeonidis, Alexandros Nanopoulos, Yann...
ICRA
2010
IEEE
136views Robotics» more  ICRA 2010»
13 years 5 months ago
Efficient planning under uncertainty for a target-tracking micro-aerial vehicle
A helicopter agent has to plan trajectories to track multiple ground targets from the air. The agent has partial information of each target's pose, and must reason about its u...
Ruijie He, Abraham Bachrach, Nicholas Roy
ICMCS
1999
IEEE
259views Multimedia» more  ICMCS 1999»
13 years 11 months ago
PhotoBuilder - 3D Models of Architectural Scenes from Uncalibrated Images
We address the problem of recovering 3D models from uncalibrated images of architectural scenes. We propose a simple, geometrically intuitive method which exploits the strong rigi...
Roberto Cipolla, Duncan P. Robertson, Edmond Boyer
TIT
2008
164views more  TIT 2008»
13 years 7 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung