Sciweavers

4123 search results - page 276 / 825
» Multiple Relational Embedding
Sort
View
CVPR
2003
IEEE
16 years 9 months ago
Tracking Appearances with Occlusions
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...
Ying Wu, Ting Yu, Gang Hua
SIGMOD
2003
ACM
150views Database» more  SIGMOD 2003»
16 years 7 months ago
Capturing both Types and Constraints in Data Integration
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juli...
VL
1996
IEEE
105views Visual Languages» more  VL 1996»
15 years 11 months ago
Enhancing Iconic Program Reusability with Object Sharing
This paper describes how to improve the reusability of iconic program modules. In iconic programming systems, the most important features for reuse are the customization of a modu...
Yuichi Koike, Yasuyuki Maeda, Yoshiyuki Koseki
AGILEDC
2005
IEEE
16 years 17 days ago
Costs of Compliance: Agile in an Inelastic Organization
Doing agile development in a relatively inelastic environment, where policies and procedures are virtually unchangeable, creates an impedance mismatch between the agile team and i...
John J. Cunningham
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu