Sciweavers

3965 search results - page 209 / 793
» Effectivity of Regular Spaces
Sort
View
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
15 years 10 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
WIESS
2000
15 years 8 months ago
Incremental Linking on HP-UX
The linker is often a time bottleneck in the development of large applications. Traditional linkers process all input files, even if only one or two objects have changed since the...
Dmitry Mikulin, Murali Vijayasundaram, Loreena Won...
ML
2010
ACM
185views Machine Learning» more  ML 2010»
15 years 1 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 9 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
CVPR
2007
IEEE
16 years 8 months ago
Concurrent Multiple Instance Learning for Image Categorization
We propose a new multiple instance learning (MIL) algorithm to learn image categories. Unlike existing MIL algorithms, in which the individual instances in a bag are assumed to be...
Guo-Jun Qi, Xian-Sheng Hua, Yong Rui, Tao Mei, Jin...