Sciweavers

4009 search results - page 276 / 802
» Clustering on Complex Graphs
Sort
View
ELPUB
2007
ACM
15 years 10 months ago
Designing Metadata Surrogates for Search Result Interfaces of Learning Object Repositories: Linear versus Clustered Metadata Des
This study reports the findings of a usability test conducted to examine users' interaction with two different learning object metadata-driven search result interfaces. The f...
Panos Balatsoukas, Anne Morris, Ann O'Brien
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
16 years 1 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
16 years 22 days ago
Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...
INFOCOM
2005
IEEE
16 years 8 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 11 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...