Sciweavers

189 search results - page 37 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
ICDE
1995
IEEE
192views Database» more  ICDE 1995»
14 years 8 months ago
Mining Sequential Patterns
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
Rakesh Agrawal, Ramakrishnan Srikant
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
COLT
2001
Springer
14 years 3 hour ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
TCOM
2008
128views more  TCOM 2008»
13 years 7 months ago
Cross-Layer Rate and Power Adaptation Strategies for IR-HARQ Systems over Fading Channels with Memory: A SMDP-Based Approach
Abstract--Incremental-redundancy hybrid automatic repeatrequest (IR-HARQ) schemes are proposed in several wireless standards for increased throughput-efficiency and greater reliabi...
Ashok K. Karmokar, Dejan V. Djonin, Vijay K. Bharg...
ECCV
2006
Springer
14 years 9 months ago
Optimal Multi-frame Correspondence with Assignment Tensors
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
R. Oliveira, R. Ferreira, J. P. Costeira