Sciweavers

2208 search results - page 405 / 442
» On Issues of Instance Selection
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 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
CORIA
2011
13 years 9 days ago
Mining the Web for lists of Named Entities
Named entities play an important role in Information Extraction. They represent unitary namable information within text. In this work, we focus on groups of named entities of the s...
Arlind Kopliku, Mohand Boughanem, Karen Pinel-Sauv...
SIGCOMM
2010
ACM
13 years 9 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
ECCV
2006
Springer
14 years 10 months ago
Sampling Strategies for Bag-of-Features Image Classification
Abstract. Bag-of-features representations have recently become popular for content based image classification owing to their simplicity and good performance. They evolved from text...
Eric Nowak, Frédéric Jurie, Bill Tri...
VIS
2008
IEEE
172views Visualization» more  VIS 2008»
14 years 10 months ago
Color Design for Illustrative Visualization
Professional designers and artists are quite cognizant of the rules that guide the design of effective color palettes, from both aesthetic and attention-guiding points of view. In ...
Lujin Wang, Joachim Giesen, Kevin T. McDonnell, ...