Sciweavers

365 search results - page 30 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
92
Voted
AAAI
2007
15 years 2 months ago
Strongly Decomposable Voting Rules on Multiattribute Domains
Sequential composition of voting rules, by making use of structural properties of the voters’ preferences, provide computationally economical ways for making a common decision o...
Lirong Xia, Jérôme Lang, Mingsheng Yi...
98
Voted
BMCBI
2010
90views more  BMCBI 2010»
15 years 21 days ago
Local alignment of generalized k-base encoded DNA sequence
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
Nils Homer, Stanley F. Nelson, Barry Merriman
108
Voted
SCALESPACE
2009
Springer
15 years 7 months ago
A Non-local Approach to Shape from Ambient Shading
We study the mathematical and numerical aspects of the estimation of the 3-D shape of a Lambertian scene seen under diffuse illumination. This problem is known as “shape from amb...
Emmanuel Prados, Nitin Jindal, Stefano Soatto
ICMCS
2006
IEEE
121views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Novel Progressive Region of Interest Image Coding Based on Matching Pursuits
— A progressive and scalable, region of interest (ROI) image coding scheme based on matching pursuits (MP) is presented. Matching pursuit is a multi-resolutional signal analysis ...
Abbas Ebrahimi-Moghadam, Shahram Shirani
101
Voted
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
16 years 1 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu