Sciweavers

1458 search results - page 37 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
SEMWEB
2007
Springer
14 years 2 months ago
Discovering Simple Mappings Between Relational Database Schemas and Ontologies
Ontologies proliferate with the growth of the Semantic Web. However, most of data on the Web are still stored in relational databases. Therefore, it is important to establish inter...
Wei Hu, Yuzhong Qu
CVPR
2008
IEEE
14 years 10 months ago
Large margin pursuit for a Conic Section classifier
Learning a discriminant becomes substantially more difficult when the datasets are high-dimensional and the available samples are few. This is often the case in computer vision an...
Santhosh Kodipaka, Arunava Banerjee, Baba C. Vemur...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime
Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can ...
Vincent Gramoli, Anne-Marie Kermarrec, Achour Most...
DATAMINE
2006
83views more  DATAMINE 2006»
13 years 8 months ago
Structural Hidden Markov Models Using a Relation of Equivalence: Application to Automotive Designs
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
Djamel Bouchaffra, Jun Tan
VC
2008
126views more  VC 2008»
13 years 8 months ago
Efficient reconstruction from non-uniform point sets
Abstract We propose a method for non-uniform reconstruction of 3D scalar data. Typically, radial basis functions, trigonometric polynomials or shift-invariant functions are used in...
Erald Vuçini, Torsten Möller, M. Eduar...