Sciweavers

2104 search results - page 71 / 421
» Sorting with networks of data structures
Sort
View
FOCS
2009
IEEE
15 years 8 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
MINENET
2006
ACM
15 years 10 months ago
SVM learning of IP address structure for latency prediction
We examine the ability to exploit the hierarchical structure of Internet addresses in order to endow network agents with predictive capabilities. Specifically, we consider Suppor...
Robert Beverly, Karen R. Sollins, Arthur Berger
WWW
2010
ACM
15 years 11 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
IROS
2008
IEEE
100views Robotics» more  IROS 2008»
15 years 10 months ago
Using structures to synchronize cameras of robots swarms
— The synchronization of image sequences acquired by robots swarms is an essential task for localization operations. We address this problem by considering the swarms as dynamic ...
Richard Chang, Sio-Hoi Ieng, Ryad Benosman
ECTEL
2006
Springer
15 years 7 months ago
Bayesian Student Models Based on Item to Item Knowledge Structures
Bayesian networks are commonly used in cognitive student modeling and assessment. They typically represent the item-concepts relationships, where items are observable responses to ...
Michel Desmarais, Michel Gagnon