Sciweavers

2126 search results - page 360 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
126
Voted
ICML
2005
IEEE
16 years 3 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
119
Voted
ICALP
2007
Springer
15 years 8 months ago
Private Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
Rafail Ostrovsky, Omkant Pandey, Amit Sahai
99
Voted
IDA
2007
Springer
15 years 8 months ago
Learning to Align: A Statistical Approach
We present a new machine learning approach to the inverse parametric sequence alignment problem: given as training examples a set of correct pairwise global alignments, find the p...
Elisa Ricci, Tijl De Bie, Nello Cristianini
QSIC
2006
IEEE
15 years 8 months ago
Static Slicing for Pervasive Programs
Pervasive programs should be context-aware, which means that program functions should react according to changing environmental conditions. Slicing, as an important class of code ...
Heng Lu, W. K. Chan, T. H. Tse
CPM
2004
Springer
94views Combinatorics» more  CPM 2004»
15 years 8 months ago
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...