Sciweavers

135 search results - page 12 / 27
» Efficiently Solving the Fractional Trust Region Problem
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
14 years 9 months ago
Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
Arvind Ganesh, John Wright, Xiaodong Li, Emmanuel ...
AAAI
2006
14 years 11 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
15 years 11 months ago
Outsourcing Search Services on Private Spatial Data
Social networking and content sharing service providers, e.g., Facebook and Google Maps, enable their users to upload and share a variety of user-generated content, including locat...
Man Lung Yiu, Gabriel Ghinita, Christian S. Jensen...
DSN
2002
IEEE
15 years 2 months ago
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
Paolo Santi, Douglas M. Blough
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
15 years 1 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht