Sciweavers

Share
TON
2010
125views more  TON 2010»
9 years 5 months ago
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an...
Reuven Cohen, Liran Katzir
JOC
2000
100views more  JOC 2000»
9 years 10 months ago
Computing Discrete Logarithms in Quadratic Orders
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
Michael J. Jacobson Jr.
COMGEO
2004
ACM
9 years 10 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
IPL
2008
70views more  IPL 2008»
9 years 10 months ago
Minimum-perimeter enclosures
We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization
Joseph S. B. Mitchell, Valentin Polishchuk
CORR
2008
Springer
107views Education» more  CORR 2008»
9 years 10 months ago
Power Series Composition and Change of Basis
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
Alin Bostan, Bruno Salvy, Éric Schost
ICML
2010
IEEE
9 years 11 months ago
Efficient Learning with Partially Observed Attributes
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the ca...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
9 years 11 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
AIPS
2006
9 years 11 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
AAAI
2004
9 years 11 months ago
Planning and Verification for Stochastic Processes with Asynchronous Events
We consider a general model of stochastic discrete event systems with asynchronous events, and propose to develop efficient algorithms for verification and control of such systems...
Håkan L. S. Younes
AAAI
2006
9 years 11 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...
books