Sciweavers

4560 search results - page 105 / 912
» Finding Data in the Neighborhood
Sort
View
WWW
2011
ACM
13 years 2 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 10 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
WOWMOM
2009
ACM
204views Multimedia» more  WOWMOM 2009»
14 years 19 days ago
ECTC: Energy effiCient topology control algorithm for wireless sensor networks
Sensor network which operates on battery are used to gather data in a variety of environments. The data collected by each node is communicated through the network to the sink, whi...
Nedal Ababneh, Anastasios Viglas, Houda Labiod, Na...
BIBM
2008
IEEE
125views Bioinformatics» more  BIBM 2008»
13 years 10 months ago
On the Role of Local Matching for Efficient Semi-supervised Protein Sequence Classification
Recent studies in protein sequence analysis have leveraged the power of unlabeled data. For example, the profile and mismatch neighborhood kernels have shown significant improveme...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic