Sciweavers

197 search results - page 20 / 40
» Efficient Inference of Partial Types
Sort
View
NIPS
2008
13 years 8 months ago
Hierarchical Semi-Markov Conditional Random Fields for Recursive Sequential Data
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
Tran The Truyen, Dinh Q. Phung, Hung Hai Bui, Svet...
CVPR
2007
IEEE
14 years 9 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
SEMWEB
2010
Springer
13 years 5 months ago
Enterprise Data Classification Using Semantic Web Technologies
Organizations today collect and store large amounts of data in various formats and locations. However they are sometimes required to locate all instances of a certain type of data....
David Ben-David, Tamar Domany, Abigail Tarem
SIGMOD
2007
ACM
162views Database» more  SIGMOD 2007»
14 years 7 months ago
Effective and efficient update of xml in RDBMS
Querying XML effectively and efficiently using declarative languages such as XQuery and XPath has been widely studied in both academic and industrial settings. Most RDBMS vendors ...
Zhen Hua Liu, Muralidhar Krishnaprasad, James W. W...
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
13 years 11 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen