Sciweavers

2878 search results - page 521 / 576
» Learning the Common Structure of Data
Sort
View
KDD
2010
ACM
240views Data Mining» more  KDD 2010»
15 years 3 months ago
Diagnosing memory leaks using graph mining on heap dumps
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
DOCENG
2005
ACM
15 years 1 months ago
Injecting information into atomic units of text
This paper presents a new approach to text processing, based on textemes. These are atomic text units generalising the concepts of character and glyph by merging them in a common ...
Yannis Haralambous, Gábor Bella
DKE
2007
82views more  DKE 2007»
14 years 12 months ago
Eliciting information for product modeling using process modeling
A product model is a formal and structured definition of product information. The most common procedure for defining a product data model is to first describe the business and/...
Ghang Lee, Charles M. Eastman, Rafael Sacks
TKDE
2010
184views more  TKDE 2010»
14 years 10 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
ASPLOS
2011
ACM
14 years 3 months ago
ConSeq: detecting concurrency bugs through sequential errors
Concurrency bugs are caused by non-deterministic interleavings between shared memory accesses. Their effects propagate through data and control dependences until they cause softwa...
Wei Zhang, Junghee Lim, Ramya Olichandran, Joel Sc...