2124 search results - page 225 / 425 » Repairing Structurally Complex Data |
ICFP
2006
ACM
14 years 10 months ago
2006
ACM
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
CIDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
DMDW
2001
13 years 11 months ago
2001
Star schema, which maintains one-to-many relationships between dimensions and a fact table, is widely accepted as the most viable data representation for dimensional analysis. Rea...
VIS
2007
IEEE
14 years 11 months ago
2007
IEEE
Volumetric data commonly has high depth complexity which makes it difficult to judge spatial relationships accurately. There are many different ways to enhance depth perception, su...