Sciweavers

1431 search results - page 272 / 287
» The complexity of random ordered structures
Sort
View
TKDE
2012
194views Formal Methods» more  TKDE 2012»
11 years 9 months ago
A Query Formulation Language for the Data Web
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...
Mustafa Jarrar, Marios D. Dikaiakos
DAC
2000
ACM
14 years 8 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 7 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
CHI
2007
ACM
14 years 7 months ago
How it works: a field study of non-technical users interacting with an intelligent system
In order to develop intelligent systems that attain the trust of their users, it is important to understand how users perceive such systems and develop those perceptions over time...
Joe Tullio, Anind K. Dey, Jason Chalecki, James Fo...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 7 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu