Sciweavers

10289 search results - page 176 / 2058
» Standard bases in K
Sort
View
INTERACT
2007
15 years 7 months ago
Investigation to Line-Based Techniques for Multi-target Selection
Abstract. This paper presents three selection techniques (called Rubber-lingsweep, Line-string and Coupling-with-pressure) to enhance multi-target acquisition in GUIs and to overco...
Jibin Yin, Xiangshi Ren
UAI
2003
15 years 7 months ago
Robust Independence Testing for Constraint-Based Learning of Causal Structure
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
Denver Dash, Marek J. Druzdzel
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 3 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
GLOBECOM
2008
IEEE
16 years 27 days ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
ACISICIS
2005
IEEE
16 years 2 days ago
A Performance Analysis Model of PC-Based Software Router Supporting IPv6-IPv4 Translation for Residential Gateway
: This paper presents a queuing analysis model of a PC-based software router supporting IPv6-IPv4 translation for residential gateway. The proposed models are M/G/1/K or MMPP-2/G/1...
Ssang-Hee Seo, In-Yeup Kong