Sciweavers

5022 search results - page 210 / 1005
» Data structures and problem solving using Java
Sort
View
JCO
2010
101views more  JCO 2010»
15 years 23 days ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
ICDM
2007
IEEE
126views Data Mining» more  ICDM 2007»
15 years 8 months ago
Exploration of Link Structure and Community-Based Node Roles in Network Analysis
Communities are nodes in a network that are grouped together based on a common set of properties. While the communities and link structures are often thought to be in alignment, i...
Jerry Scripps, Pang-Ning Tan, Abdol-Hossein Esfaha...
POPL
1992
ACM
15 years 6 months ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali
ICCV
2009
IEEE
15 years 2 days ago
Improving accuracy of geometric parameter estimation using projected score method
A fundamental problem in computer vision (CV) is the estimation of geometric parameters from multiple observations obtained from images; examples of such problems range from ellip...
Takayuki Okatani, Koichiro Deguchi
ISCI
2008
116views more  ISCI 2008»
15 years 2 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu